Applying Deep Bidirectional LSTM and Mixture Density Network for Basketball Trajectory Prediction

Data analytics helps basketball teams to create tactics. However, manual data collection and analytics are costly and ineffective. Therefore, we applied a deep bidirectional long short-term memory (BLSTM) and mixture density network (MDN) approach. This model is not only capable of predicting a basketball trajectory based on real data, but it also can generate new trajectory samples. It is an excellent application to help coaches and players decide when and where to shoot. Its structure is particularly suitable for dealing with time series problems. BLSTM receives forward and backward information at the same time, while stacking multiple BLSTMs further increases the learning ability of the model. Combined with BLSTMs, MDN is used to generate a multi-modal distribution of outputs. Thus, the proposed model can, in principle, represent arbitrary conditional probability distributions of output variables. We tested our model with two experiments on three-pointer datasets from NBA SportVu data. In the hit-or-miss classification experiment, the proposed model outperformed other models in terms of the convergence speed and accuracy. In the trajectory generation experiment, eight model-generated trajectories at a given time closely matched real trajectories

Influence of Sensor Nodes on the Invulnerability of Tree Network

In the transformation process from the complex system of great industrial era to the information era, the component having sensing function plays an important role in the evolution of complex system. To abstract the complex system of “tree” structure as “tree” network, To abstract the components include the component having sensing function as nodes, and how the sensor nodes in the network affect network invulnerability is studied quantitatively in this paper. Firstly, the experimental program for network invulnerability is designed; secondly, the indicators for measuring the network invulnerability and the importance of node are proposed; then, the invulnerability experiments are carried out in two conditions-with or without sensor nodes in “tree” network; finally the experimental data are statistically analyzed. Results show that after the addition of sensor nodes, the invulnerability of “tree” network is promoted when subject to random attack and particular attack. The research results are of reference significance for improving self-invulnerability in the transformation process from complex system to information. The experimental program and the relevant conclusions obtained by experiment in this paper have certain innovation

Improvement on Load-Induced Cascading Failure in Asymmetrical Interdependent Networks: Modeling and Analysis

Many real-world systems can be depicted as interdependent networks and they usually show an obvious property of asymmetry. Furthermore, node or edge failure can trigger load redistribution which leads to a cascade of failure in the whole network. In order to deeply investigate the load-induced cascading failure, firstly, an asymmetrical model of interdependent network consisting of a hierarchical weighted network and a WS small-world network is constructed. Secondly, an improved “load-capacity” model is applied for node failure and edge failure, respectively, followed by a series of simulations of cascading failure over networks in both interdependent and isolated statuses. The simulation results prove that the robustness in isolated network changes more promptly than that in the interdependent one. Network robustness is positively related to “capacity,” but negatively related to “load.” The hierarchical weight structure in the subnetwork leads to a “plateau” phenomenon in the progress of cascading failure

Dynamic Multiaircraft Cooperative Suppression Interference Array Optimization by Dynamic MOPSO Algorithm

Dynamic multiaircraft cooperative suppression interference array (MACSIA) optimization problem is a typical dynamic multiobjective optimization problem. In this paper, the sum of the distance between each jamming aircraft and the enemy air defense radar network center and the minimum width of the safety area for route planning are taken as the objective functions. The dynamic changes in the battlefield environment are reduced to two cases. One is that the location of the enemy air defense radar is mobile, but the number remains the same. The other is that the number of the enemy air defense radars is variable, but the original location remains unchanged. Thus, two dynamic multiobjective optimization models of dynamic MACSIA are constructed. The dynamic multiobjective particle swarm optimization algorithm is used to solve the two models, respectively. The optimal dynamic MACSIA schemes which satisfy the limitation of the given suppression interference effect and ensure the safety of the jamming aircraft themselves are obtained by simulation experiments. And then verify the correctness of the constructed dynamic multiobjective optimization model, as well as the feasibility and effectiveness of the dynamic multiobjective particle swarm optimization algorithm in solving dynamic MACSIA problem

Multi-Target Strike Path Planning Based on Improved Decomposition Evolutionary Algorithm

This study proposes a path-finding model for multi-target strike planning. The model evaluates three elements, i.e., the target value, the aircraft’s threat tolerance, and the battlefield threat, and optimizes the striking path by constraining the balance between mission execution and the combat survival. In order to improve the speed of the Multi-Objective Evolutionary Algorithm Based on Decomposition (MOEA/D), we use the conjugate gradient method for optimization. A Gaussian perturbation is added to the search points to make their distribution closer to the population distribution. The simulation shows that the proposed method effectively chooses its target according to the target value and the aircraft’s acceptable threat value, completes the strike on high value targets, evades threats, and verifies the feasibility and effectiveness of the multi-objective optimization model

Research on Multiaircraft Cooperative Suppression Interference Array Based on an Improved Multiobjective Particle Swarm Optimization Algorithm

For the problem of multiaircraft cooperative suppression interference array (MACSIA) against the enemy air defense radar network in electronic warfare mission planning, firstly, the concept of route planning security zone is proposed and the solution to get the minimum width of security zone based on mathematical morphology is put forward. Secondly, the minimum width of security zone and the sum of the distance between each jamming aircraft and the center of radar network are regarded as objective function, and the multiobjective optimization model of MACSIA is built, and then an improved multiobjective particle swarm optimization algorithm is used to solve the model. The decomposition mechanism is adopted and the proportional distribution is used to maintain diversity of the new found nondominated solutions. Finally, the Pareto optimal solutions are analyzed by simulation, and the optimal MACSIA schemes of each jamming aircraft suppression against the enemy air defense radar network are obtained and verify that the built multiobjective optimization model is corrected. It also shows that the improved multiobjective particle swarm optimization algorithm for solving the problem of MACSIA is feasible and effective